Relativized alternation and space-bounded computation
نویسندگان
چکیده
منابع مشابه
Hierarchies of Relativized Time - Bounded
Some results on relativized time-bounded complexity classes are presented. There can be many kinds of hierarchies of complexity subclasses of relativized NP. For brevity, let P(A, k) \NP(A, k)} be the relativized complexity class DTIME^(/i*) [resp. NTIME^/i*)] with respect to oracle set A. (For k=l, replace n by 2ri). Then for example: 1). There is an oracle set A such that for all k>Q P(A, k) ...
متن کاملSharply Bounded Alternation within P
We deene the sharply bounded hierarchy, SBH (QL), a hierarchy of classes within P , using quasilinear-time computation and quantiication over values of length log n. It generalizes the limited nondeterminism hierarchy introduced by Buss and Gold-smith, while retaining the invariance properties. The new hierarchy has several alternative characterizations. We deene both SBH (QL) and its correspon...
متن کاملAlternation and Bounded Concurrency Are Reverse Equivalent
Numerous models of concurrency have been considered in the framework of automata. Among the more interesting concurrency models are classical nondeterminism and pure concur-rency, the two facets of alternation, and the bounded concurrency model. Bounded concurrency was previously considered to be similar to nondeterminism and pure concurrency in the sense of the succinctness of automata augment...
متن کاملComputation by interaction for space-bounded functional programming
We consider the problem of supporting sublinear space programming in a functional programming language. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot compose functions directly for lack of space for the intermediate result, but must instead compute and recompute small parts of the intermediate re...
متن کاملRelativized Separation of Reversible and Irreversible Space-Time Complexity Classes
Reversible computing can reduce the energy dissipation of computation, which can improve cost-efficiency in some contexts. But the practical applicability of this method depends sensitively on the space and time overhead required by reversible algorithms. Time and space complexity classes for reversible machines match conventional ones, but we conjecture that the joint space-time complexity cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90034-7